- sieving algorithm
- алгоритм просеивания
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
sieving algorithm
Смотреть что такое "sieving algorithm" в других словарях:
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Cipolla's algorithm — In computational number theory, Cipolla s algorithm is a technique for solving a congruence of the form x2 = n, where , so n is the square of x, and where p is an odd prime. Here denotes the finite field with p elements; . Th … Wikipedia
Cornacchia's algorithm — In computational number theory, Cornacchia s algorithm is an algorithm for solving the Diophantine equation x2 + dy2 = m, where and d and m are coprime. The algorithm was described in 1908 by Giuseppe Cornacchia[1]. Contents 1 The algorithm … Wikipedia
Williams' p + 1 algorithm — In computational number theory, Williams p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be… … Wikipedia
Lattice sieving — is a technique for finding smooth values of a bivariate polynomial f(a,b) over a large region. It is almost exclusively used in connection with the number field sieve.The algorithm implicitly involves the ideal structure of the number field of… … Wikipedia
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of … Wikipedia
Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… … Wikipedia
Special number field sieve — The special number field sieve (SNFS) is a special purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from it.The special number field sieve is efficient for integers of the form r e plusmn; s , where r and … Wikipedia
TWINKLE — is a hypothetical integer factorization device described in 1999 by Adi Shamir and purported to be capable of factoring 512 bit integers. The name is an acronym of The Weizmann Institute Key Locating Engine . It is also a pun on the twinkling… … Wikipedia
AKS primality test — The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality proving algorithm created and published by three Indian Institute of Technology Kanpur computer scientists, Manindra… … Wikipedia
